Gencrypt: one-way cryptographic hashes to detect overlapping individuals across samples
نویسندگان
چکیده
Meta-analysis across genome-wide association studies is a common approach for discovering genetic associations. However, in some meta-analysis efforts, individual-level data cannot be broadly shared by study investigators due to privacy and Institutional Review Board concerns. In such cases, researchers cannot confirm that each study represents a unique group of people, leading to potentially inflated test statistics and false positives. To resolve this problem, we created a software tool, Gencrypt, which utilizes a security protocol known as one-way cryptographic hashes to allow overlapping participants to be identified without sharing individual-level data.
منابع مشابه
Sound and complete computational interpretation of symbolic hashes in the standard model
This paper provides one more step towards bridging the gap between the formal and computational approaches to the verification of cryptographic protocols. We extend the well-known Abadi-Rogaway logic with probabilistic hashes and give a precise semantic interpretation to it using Canetti’s oracle hashes. These are probabilistic polynomialtime hashes that hide all partial information. Finally, w...
متن کاملSound Computational Interpretation of Symbolic Hashes in the Standard Model
This paper provides one more step towards bridging the gap between the formal and computational approaches to the verification of cryptographic protocols. We extend the well-known Abadi-Rogaway logic with probabilistic hashes and we give a precise semantic interpretation to it using Canetti’s oracle hashes. These are probabilistic polynomialtime hashes that hide all partial information. Finally...
متن کاملSound Computational Interpretation of Formal Hashes
This paper provides one more step towards bridging the gap between the formal and computational approaches to cryptographic protocols. We extend the well-known Abadi-Rogaway logic with probabilistic hashes and we give precise semantic to it using Canetti’s oracle hashing. Finally, we show that this interpretation is computationally sound.
متن کاملFind Me a Hash, Volume 53, Number 3
W e're accustomed to hearing about the unreasonable effectiveness of mathematics, delightful—and unex-pected—applications of theory to the real world. In the world of the In-ternet, we've seen it in the use of number theory in public-key cryptography (the Diffie-Hellman system , the RSA algorithm, elliptic curve cryptosys-tems), in the utilization of graph theory in network design. In the world...
متن کاملFind Me a Hash
W e're accustomed to hearing about the unreasonable effectiveness of mathematics, delightful—and unex-pected—applications of theory to the real world. In the world of the In-ternet, we've seen it in the use of number theory in public-key cryptography (the Diffie-Hellman system , the RSA algorithm, elliptic curve cryptosys-tems), in the utilization of graph theory in network design. In the world...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Bioinformatics
دوره 28 6 شماره
صفحات -
تاریخ انتشار 2012